Orthologic Tetrahedra with Intersecting Edges
نویسنده
چکیده
Two tetrahedra are called orthologic if the lines through vertices of one and perpendicular to corresponding faces of the other are intersecting. This is equivalent to the orthogonality of non-corresponding edges. We prove that the additional assumption of intersecting non-corresponding edges (“orthosecting tetrahedra”) implies that the six intersection points lie on a sphere. To a given tetrahedron there exists generally a one-parametric family of orthosecting tetrahedra. The orthographic projection of the locus of one vertex onto the corresponding face plane of the given tetrahedron is a curve which remains fixed under isogonal conjugation. This allows the construction of pairs of conjugate orthosecting tetrahedra to a given tetrahedron.
منابع مشابه
Automatic Grid Generation with Almost Regular Delaunay Tetrahedra
An algorithm for constructing almost regular triangulations (ARTs) for three-dimensional polygonal domains is described. Ideally such triangulations consist entirely of congruent tetrahedra with nearly equal edges. The new feature of this method is that the position of the vertices is adjusted, before any connecting edges are assigned. This leads to grids with very few irregular vertices, i.e. ...
متن کاملCommon Edge-Unzippings for Tetrahedra
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.
متن کاملOn Different Proof-Search Strategies for Orthologic
In this paper, we consider three different search strategies for a cut-free sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential. In a combined forward and backward approach, all proofs are polynomial, but the potential search space re...
متن کاملGeometric Graphs with No Self-intersecting Path of Length Three
Let G be a geometric graph with n vertices, i.e., a graph drawn in the plane with straight-line edges. It is shown that if G has no self-intersecting path of length 3, then its number of edges is O(n log n). This result is asymptotically tight. Analogous questions for longer forbidden paths and for graphs drawn by not necessarily straight-line edges are also considered.
متن کاملExtremal Graph for Intersecting Odd Cycles
An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...
متن کامل